HKUST Institutional Repository
نویسندگان
چکیده
Let P and Q be disjoint polygons in the plane. We consider problems of finding an optimal bridge (p, q), p ∈ ∂P and q ∈ ∂Q, such that the length of the longest path from a point in P , passing through the bridge (p, q), to a point Q is minimized. We propose efficient algorithms for three problems according to whether P and Q are convex or not. The algorithms developed can be easily extended to more general problems in which a set S of points in P and a set T of points in Q are given, and the goal is to find a bridge (p, q) such that minimizes the length of the longest path connecting a point in S, passing through (p, q), to a point in T . These problems are motivated from the bridge construction between two islands (or the canal construction between two lakes).
منابع مشابه
Building an institutional repository: sharing experiences at the HKUST Library
Purpose To document HKUST’s experiences in developing its Institutional Repository and to highlight its programming developments in full-text linking and indexing, and cross institutional searching. Design/methodology/approach This paper describes how HKUST Library planned and set up its Institutional Repository, how it acquired and processed the scholarly output, and what procedures and guidel...
متن کاملHKUST Institutional Repository
We describe a new simple conceptual model for tables The conceptual model treats a table as a map that has a domain which is a product of categories or index sets and a codomain which is a set of entry values We demonstrate how we can use the model to specify the semantics of some tabular editing operations
متن کاملHKUST Institutional Repository
We consider the following problem Given a simple polygon P possibly with holes and having n vertices compute a pair of equal radius disks that do not intersect each other are contained in P and whose radius is maximized Our main result is a simple randomized algorithm whose expected running time on worst case input is O n log n
متن کاملHKUST Institutional Repository
This paper reviews model based methods for non rigid shape analysis and recognition These methods model match and classify non rigid shapes which are generally problematic for conventional algorithms using rigid models Issues including deformable model represen tation optimization criteria formulation model matching and classi cation are examined in detail The emphasis of this paper is on D def...
متن کامل